Computational problem

Results: 1172



#Item
951Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation

Progress on the Complexity of Counting Problems Jin-Yi Cai University of Wisconsin, Madison Asian Association for Algorithms and Computation

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2010-12-31 10:46:04
952Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2011-07-11 20:52:11
953How a Generative Encoding Fares as Problem-Regularity Decreases Jeff Clune1, Charles Ofria1, and Robert T. Pennock1,2 Department of Computer Science and Engineering, Department of Philosophy & Lyman Briggs College Michig

How a Generative Encoding Fares as Problem-Regularity Decreases Jeff Clune1, Charles Ofria1, and Robert T. Pennock1,2 Department of Computer Science and Engineering, Department of Philosophy & Lyman Briggs College Michig

Add to Reading List

Source URL: ofria.com

Language: English - Date: 2013-02-07 15:35:35
954Progress in Computational Complexity Theory Hong Zhu† Computer Sciences Department, Fudan University Shanghai[removed], China. Email: [removed]

Progress in Computational Complexity Theory Hong Zhu† Computer Sciences Department, Fudan University Shanghai[removed], China. Email: [removed]

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2006-02-17 15:41:40
955Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed]

Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed]

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2007-09-05 18:26:13
956COUNTING LATTICE VECTORS DENIS XAVIER CHARLES Abstract. We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that t

COUNTING LATTICE VECTORS DENIS XAVIER CHARLES Abstract. We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that t

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2005-01-20 18:37:07
957Twisting knobs and connecting things: Rethinking Technology & Creativity in the 21st Century By Danah Henriksen, Punya Mishra, & the Deep-Play Research Group Michigan State University

Twisting knobs and connecting things: Rethinking Technology & Creativity in the 21st Century By Danah Henriksen, Punya Mishra, & the Deep-Play Research Group Michigan State University

Add to Reading List

Source URL: punya.educ.msu.edu

Language: English - Date: 2014-01-07 13:29:56
958Applied Inverse Problems: Theoretical and Computational Aspects UCLA Lake Arrowhead Conference Center Sunday, May 18, 2003 2:00 4:30

Applied Inverse Problems: Theoretical and Computational Aspects UCLA Lake Arrowhead Conference Center Sunday, May 18, 2003 2:00 4:30

Add to Reading List

Source URL: www.ipam.ucla.edu

Language: English - Date: 2003-05-14 19:16:38
959Curriculum Vitae Palash Sarkar Professor Applied Statistics Unit Indian Statistical Institute

Curriculum Vitae Palash Sarkar Professor Applied Statistics Unit Indian Statistical Institute

Add to Reading List

Source URL: www.isical.ac.in

Language: English - Date: 2014-04-16 02:49:00